The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, INF).

(0) Obligation:

Runtime Complexity TRS:
The TRS R consists of the following rules:

p(0) → 0
p(s(x)) → x
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
minus(x, y) → if(le(x, y), x, y)
if(true, x, y) → 0
if(false, x, y) → s(minus(p(x), y))

Rewrite Strategy: INNERMOST

(1) RenamingProof (EQUIVALENT transformation)

Renamed function symbols to avoid clashes with predefined symbol.

(2) Obligation:

Runtime Complexity Relative TRS:
The TRS R consists of the following rules:

p(0') → 0'
p(s(x)) → x
le(0', y) → true
le(s(x), 0') → false
le(s(x), s(y)) → le(x, y)
minus(x, y) → if(le(x, y), x, y)
if(true, x, y) → 0'
if(false, x, y) → s(minus(p(x), y))

S is empty.
Rewrite Strategy: INNERMOST

(3) TypeInferenceProof (BOTH BOUNDS(ID, ID) transformation)

Infered types.

(4) Obligation:

Innermost TRS:
Rules:
p(0') → 0'
p(s(x)) → x
le(0', y) → true
le(s(x), 0') → false
le(s(x), s(y)) → le(x, y)
minus(x, y) → if(le(x, y), x, y)
if(true, x, y) → 0'
if(false, x, y) → s(minus(p(x), y))

Types:
p :: 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
le :: 0':s → 0':s → true:false
true :: true:false
false :: true:false
minus :: 0':s → 0':s → 0':s
if :: true:false → 0':s → 0':s → 0':s
hole_0':s1_0 :: 0':s
hole_true:false2_0 :: true:false
gen_0':s3_0 :: Nat → 0':s

(5) OrderProof (LOWER BOUND(ID) transformation)

Heuristically decided to analyse the following defined symbols:
le, minus

They will be analysed ascendingly in the following order:
le < minus

(6) Obligation:

Innermost TRS:
Rules:
p(0') → 0'
p(s(x)) → x
le(0', y) → true
le(s(x), 0') → false
le(s(x), s(y)) → le(x, y)
minus(x, y) → if(le(x, y), x, y)
if(true, x, y) → 0'
if(false, x, y) → s(minus(p(x), y))

Types:
p :: 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
le :: 0':s → 0':s → true:false
true :: true:false
false :: true:false
minus :: 0':s → 0':s → 0':s
if :: true:false → 0':s → 0':s → 0':s
hole_0':s1_0 :: 0':s
hole_true:false2_0 :: true:false
gen_0':s3_0 :: Nat → 0':s

Generator Equations:
gen_0':s3_0(0) ⇔ 0'
gen_0':s3_0(+(x, 1)) ⇔ s(gen_0':s3_0(x))

The following defined symbols remain to be analysed:
le, minus

They will be analysed ascendingly in the following order:
le < minus

(7) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
le(gen_0':s3_0(n5_0), gen_0':s3_0(n5_0)) → true, rt ∈ Ω(1 + n5₀)

Induction Base:
le(gen_0':s3_0(0), gen_0':s3_0(0)) →_R^Ω(1)
true

Induction Step:
le(gen_0':s3_0(+(n5_0, 1)), gen_0':s3_0(+(n5_0, 1))) →_R^Ω(1)
le(gen_0':s3_0(n5_0), gen_0':s3_0(n5_0)) →_IH
true

We have rt ∈ Ω(n¹) and sz ∈ O(n). Thus, we have irc_R ∈ Ω(n).

(8) Complex Obligation (BEST)

(9) Obligation:

Innermost TRS:
Rules:
p(0') → 0'
p(s(x)) → x
le(0', y) → true
le(s(x), 0') → false
le(s(x), s(y)) → le(x, y)
minus(x, y) → if(le(x, y), x, y)
if(true, x, y) → 0'
if(false, x, y) → s(minus(p(x), y))

Types:
p :: 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
le :: 0':s → 0':s → true:false
true :: true:false
false :: true:false
minus :: 0':s → 0':s → 0':s
if :: true:false → 0':s → 0':s → 0':s
hole_0':s1_0 :: 0':s
hole_true:false2_0 :: true:false
gen_0':s3_0 :: Nat → 0':s

Lemmas:
le(gen_0':s3_0(n5_0), gen_0':s3_0(n5_0)) → true, rt ∈ Ω(1 + n5₀)

Generator Equations:
gen_0':s3_0(0) ⇔ 0'
gen_0':s3_0(+(x, 1)) ⇔ s(gen_0':s3_0(x))

The following defined symbols remain to be analysed:
minus

(10) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

Could not prove a rewrite lemma for the defined symbol minus.

(11) Obligation:

Innermost TRS:
Rules:
p(0') → 0'
p(s(x)) → x
le(0', y) → true
le(s(x), 0') → false
le(s(x), s(y)) → le(x, y)
minus(x, y) → if(le(x, y), x, y)
if(true, x, y) → 0'
if(false, x, y) → s(minus(p(x), y))

Types:
p :: 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
le :: 0':s → 0':s → true:false
true :: true:false
false :: true:false
minus :: 0':s → 0':s → 0':s
if :: true:false → 0':s → 0':s → 0':s
hole_0':s1_0 :: 0':s
hole_true:false2_0 :: true:false
gen_0':s3_0 :: Nat → 0':s

Lemmas:
le(gen_0':s3_0(n5_0), gen_0':s3_0(n5_0)) → true, rt ∈ Ω(1 + n5₀)

Generator Equations:
gen_0':s3_0(0) ⇔ 0'
gen_0':s3_0(+(x, 1)) ⇔ s(gen_0':s3_0(x))

No more defined symbols left to analyse.

(12) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
le(gen_0':s3_0(n5_0), gen_0':s3_0(n5_0)) → true, rt ∈ Ω(1 + n5₀)

(13) BOUNDS(n^1, INF)

(14) Obligation:

Innermost TRS:
Rules:
p(0') → 0'
p(s(x)) → x
le(0', y) → true
le(s(x), 0') → false
le(s(x), s(y)) → le(x, y)
minus(x, y) → if(le(x, y), x, y)
if(true, x, y) → 0'
if(false, x, y) → s(minus(p(x), y))

Types:
p :: 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
le :: 0':s → 0':s → true:false
true :: true:false
false :: true:false
minus :: 0':s → 0':s → 0':s
if :: true:false → 0':s → 0':s → 0':s
hole_0':s1_0 :: 0':s
hole_true:false2_0 :: true:false
gen_0':s3_0 :: Nat → 0':s

Lemmas:
le(gen_0':s3_0(n5_0), gen_0':s3_0(n5_0)) → true, rt ∈ Ω(1 + n5₀)

Generator Equations:
gen_0':s3_0(0) ⇔ 0'
gen_0':s3_0(+(x, 1)) ⇔ s(gen_0':s3_0(x))

No more defined symbols left to analyse.

(15) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
le(gen_0':s3_0(n5_0), gen_0':s3_0(n5_0)) → true, rt ∈ Ω(1 + n5₀)

(16) BOUNDS(n^1, INF)